منابع مشابه
Equivalent Double - Loop Networks
Hwang and Xu defined equivalent double-loop networks and gave one such result showing that the L-shapes of the two equivalent networks are recombinations of three rectangles. Recently, Rödseth gave an elegant algebraic theorem for equivalent multi-loop networks. We show that its double-loop version yields equivalent networks of the 3rectangle version. We also show that other seemingly different...
متن کاملMinimum Delay Data Gathering in Radio Networks
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the time is slotted and that during one time slot (step) each node can transmit to one of its neighbors at most one data item. Each device is equipped with a half duplex interface; so a node cannot both ...
متن کاملMinimum delay routing for wireless networks with STDMA
STDMA emerges as a promising channel access technique for providing Quality of Service (QoS) guarantees in multi-hop ad hoc networks such as community mesh and sensor networks. The contention-free channel access combined with spatial reuse of the channel provide significant benefits in the energy/throughput tradeoff. On the other hand, the time-multiplexed communication introduces extra delay o...
متن کاملMinimum Delay Routing in Multihop Wireless Networks
End-to-end delay is an important QoS metric in multihop wireless networks such as sensor networks and mesh networks. Along with throughput, end-to-end delay determines the user-experienced data transmission time. End-to-end delay refers to the total time it takes for a single packet to reach the destination. It is a result of many factors including the length of the route and the interference l...
متن کاملTriple-loop networks with arbitrarily many minimum distance diagrams
Minimum distance diagrams are a way to encode the diameter and routing information of multi-loop networks. For the widely studied case of double-loop networks, it is known that each network has at most two such diagrams and that they have a very definite form (" L-shape "). In contrast, in this paper we show that there are triple-loop networks with an arbitrarily big number of associated minimu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1987
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90123-3